A unifying framework for $k$-statistics, polykays and their multivariate generalizations
نویسندگان
چکیده
منابع مشابه
A unifying framework for k-statistics, polykays and their multivariate generalizations
Extending umbral methods introduced by Di Nardo and Senato (2006b), in this paper we provide an unifying syntax for single and multivariate k-statistics, polykays and multivariate polykays. From a combinatorial point of view, we revisit the theory as exposed by Stuart and Ord (1987) taking into account the Doubilet approach to symmetric functions. The Moebius function, occurring in the relation...
متن کاملWidth-k Generalizations of Classical Permutation Statistics
We introduce new natural generalizations of the classical descent and inversion statistics for permutations, called width-k descents and width-k inversions. These variations induce generalizations of the excedance and major statistics, providing a framework in which well-known equidistributivity results for classical statistics are paralleled. We explore additional relationships among the stati...
متن کاملA unifying modeling framework for highly multivariate disease mapping.
Multivariate disease mapping refers to the joint mapping of multiple diseases from regionally aggregated data and continues to be the subject of considerable attention for biostatisticians and spatial epidemiologists. The key issue is to map multiple diseases accounting for any correlations among themselves. Recently, Martinez-Beneito (2013) provided a unifying framework for multivariate diseas...
متن کاملA unifying framework for natural image statistics: spatiotemporal activity bubbles
Recently, di+erent models of the statistical structure of natural images (and sequences) have been proposed. Maximizing sparseness, or alternatively temporal coherence of linear 1lter outputs leads to the emergence of simple cell properties. Taking account of the basic dependencies of linear 1lter outputs enables modelling of complex cell and topographic properties as well. Here, we propose a u...
متن کاملA unifying framework for greedy mining approximate top-k binary patterns and their evaluation
A major mining task for binary matrixes is the extraction of approximate top-k patterns that are able to concisely describe the input data. The top-k pattern discovery problem is commonly stated as an optimization one, where the goal is to minimize a given cost function, e.g. the accuracy of the data description. In this work, we review several greedy algorithms, and also discuss PaNDa, an enha...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bernoulli
سال: 2008
ISSN: 1350-7265
DOI: 10.3150/07-bej6163